Descriptive Graph Combinatorics
نویسندگان
چکیده
In this article we survey the emerging field of descriptive graph combinatorics. This area has developed in the last two decades or so at the interface of descriptive set theory and graph theory, and it has interesting connections with other areas such as ergodic theory and probability theory. Our object of study is the theory of definable graphs, usually Borel or analytic graphs on Polish spaces. We investigate how combinatorial concepts, such as colorings and matchings, behave under definability constraints, i.e., when they are required to be definable or perhaps well-behaved in the topological or measure theoretic sense. To illustrate the new phenomena that can arise in the definable context, consider for example colorings of graphs. As usual a Y -coloring of a graph G = (X,G), where X is the set of vertices and G ⊆ X2 the edge relation, is a map c : X → Y such that xGy =⇒ c(x) 6= c(y). An elementary result in graph theory asserts that any acyclic graph admits a 2-coloring (i.e., a coloring as above with |Y | = 2). On the other hand, consider a Borel graph G = (X,G), where X is a Polish space and G is Borel (in X2). A Borel coloring of G is a coloring c : X → Y as above with Y a Polish space and c a Borel map. In contrast to the above basic fact, there are acyclic Borel graphs G which admit no Borel countable coloring (i.e., with |Y | ≤ א0); see Example 3.14. Moreover for each n ≥ 2, one can find acyclic Borel graphs G, which admit a Borel n-coloring but no Borel m-coloring for any m < n; see the first paragraph of Subsection 5,(A). However, sometimes results of classical graph theory have definable counterparts. For example, another standard result in graph theory asserts that every graph of degree at most d admits a (d+ 1)-coloring. It turns out that every Borel graph of degree at most d actually admits a Borel (d+1)-coloring; see Proposition 4.4. Another interesting example of the interplay between combinatorics and definability
منابع مشابه
Homogeneous Structures
A relational first order structure is homogeneous if every isomorphism between finite substructures extends to an automorphism. Familiar examples of such structures include the rational numbers with the usual order relation, the countable random and so called Rado graph, and many others. Countable homogeneous structures arise as Fraı̈ssé limits of amalgamation classes of finite structures, and h...
متن کاملRachel Esselstein Research Statement
My research interests involve Finite Model Theory and Descriptive Complexity, an area of research nestled in the intersection of Combinatorics, Logic and Computer Science. Inspired by Ehrenfeucht–Fräıssé games, I have been studying local properties of regular colored graphs– in particular, the computational complexity of realizing a given set of neighborhoods in a graph.
متن کاملFirst-Order Definability of Trees and Sparse Random Graphs
Let D(G) be the smallest quantifier depth of a first order formula which is true for a graph G but false for any other non-isomorphic graph. This can be viewed as a measure for the descriptive complexity of G in first order logic. We show that almost surely D(G) = Θ( ln n ln ln n ), where G is a random tree of order n or the giant component of a random graph G(n, c n ) with constant c > 1. Thes...
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملPeripheral Wiener Index of a Graph
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
متن کامل